0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.11/0.33 % Computer : n015.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 1920 0.11/0.33 % WCLimit : 240 0.11/0.33 % DateTime : Wed Jul 30 02:30:34 EDT 2025 0.11/0.33 % CPUTime : 0.20/0.48 Running higher-order theorem proving 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.bbjBABaI6V/E---3.1_20909.p 0.20/0.50 # Version: 3.0.0-ho 0.20/0.50 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.50 # Starting ho_unfolding_3 with 1200s (5) cores 0.20/0.50 # Starting ehoh_best2_full_lfho with 240s (1) cores 0.20/0.50 # Starting almost_fo_3_lam with 240s (1) cores 0.20/0.50 # Starting post_as_ho1 with 240s (1) cores 0.20/0.50 # ehoh_best2_full_lfho with pid 21046 completed with status 0 0.20/0.50 # Result found by ehoh_best2_full_lfho 0.20/0.50 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.50 # Starting ho_unfolding_3 with 1200s (5) cores 0.20/0.50 # Starting ehoh_best2_full_lfho with 240s (1) cores 0.20/0.50 # No SInE strategy applied 0.20/0.50 # Search class: HHHNF-FFSF00-SHSSMFNN 0.20/0.50 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.20/0.50 # Starting new_ho_10 with 130s (1) cores 0.20/0.50 # new_ho_10 with pid 21052 completed with status 0 0.20/0.50 # Result found by new_ho_10 0.20/0.50 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.50 # Starting ho_unfolding_3 with 1200s (5) cores 0.20/0.50 # Starting ehoh_best2_full_lfho with 240s (1) cores 0.20/0.50 # No SInE strategy applied 0.20/0.50 # Search class: HHHNF-FFSF00-SHSSMFNN 0.20/0.50 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.20/0.50 # Starting new_ho_10 with 130s (1) cores 0.20/0.50 # Preprocessing time : 0.001 s 0.20/0.50 # Presaturation interreduction done 0.20/0.50 0.20/0.50 # Proof found! 0.20/0.50 # SZS status Theorem 0.20/0.50 # SZS output start CNFRefutation 0.20/0.50 thf(decl_37, type, cartesian_product: ($i > $o) > ($i > $o) > $i > $i > $o). 0.20/0.50 thf(decl_40, type, sub_rel: ($i > $i > $o) > ($i > $i > $o) > $o). 0.20/0.50 thf(decl_58, type, epred1_0: $i > $i > $o). 0.20/0.50 thf(decl_59, type, epred2_0: $i > $i > $o). 0.20/0.50 thf(decl_60, type, esk1_0: $i). 0.20/0.50 thf(decl_61, type, esk2_0: $i). 0.20/0.50 thf(cartesian_product, axiom, ((cartesian_product)=(^[X22:$i > $o, X23:$i > $o, X4:$i, X24:$i]:(((X22 @ X4)&(X23 @ X24))))), file('/export/starexec/sandbox2/tmp/tmp.bbjBABaI6V/E---3.1_20909.p', cartesian_product)). 0.20/0.50 thf(sub_rel, axiom, ((sub_rel)=(^[X26:$i > $i > $o, X27:$i > $i > $o]:(![X1:$i, X3:$i]:(((X26 @ X1 @ X3)=>(X27 @ X1 @ X3)))))), file('/export/starexec/sandbox2/tmp/tmp.bbjBABaI6V/E---3.1_20909.p', sub_rel)). 0.20/0.50 thf(thm, conjecture, ![X28:$i > $i > $o, X36:$i > $i > $o]:(((sub_rel @ X28 @ (cartesian_product @ (^[X1:$i]:(($true))) @ (^[X1:$i]:(($true)))))<=(sub_rel @ X28 @ X36))), file('/export/starexec/sandbox2/tmp/tmp.bbjBABaI6V/E---3.1_20909.p', thm)). 0.20/0.50 thf(c_0_3, plain, ((cartesian_product)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i, Z3:$i]:(((Z0 @ Z2)&(Z1 @ Z3))))), inference(fof_simplification,[status(thm)],[cartesian_product])). 0.20/0.50 thf(c_0_4, plain, ((sub_rel)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $i > $o]:(![X1:$i, X3:$i]:(((Z0 @ X1 @ X3)=>(Z1 @ X1 @ X3)))))), inference(fof_simplification,[status(thm)],[sub_rel])). 0.20/0.50 thf(c_0_5, negated_conjecture, ~(![X28:$i > $i > $o, X36:$i > $i > $o]:((![X49:$i, X50:$i]:(((X28 @ X49 @ X50)=>(X36 @ X49 @ X50)))=>![X47:$i, X48:$i]:(((X28 @ X47 @ X48)=>$true))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thm])]), c_0_3]), c_0_4])])). 0.20/0.50 thf(c_0_6, negated_conjecture, ![X53:$i, X54:$i]:(((~(epred1_0 @ X53 @ X54)|(epred2_0 @ X53 @ X54))&((epred1_0 @ esk1_0 @ esk2_0)&~($true)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])). 0.20/0.50 thf(c_0_7, negated_conjecture, ~(($true)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.20/0.50 thf(c_0_8, negated_conjecture, ($false), inference(cn,[status(thm)],[c_0_7]), ['proof']). 0.20/0.50 # SZS output end CNFRefutation 0.20/0.50 # Parsed axioms : 71 0.20/0.50 # Removed by relevancy pruning/SinE : 0 0.20/0.50 # Initial clauses : 38 0.20/0.50 # Removed in clause preprocessing : 35 0.20/0.50 # Initial clauses in saturation : 3 0.20/0.50 # Processed clauses : 1 0.20/0.50 # ...of these trivial : 0 0.20/0.50 # ...subsumed : 0 0.20/0.50 # ...remaining for further processing : 0 0.20/0.50 # Other redundant clauses eliminated : 0 0.20/0.50 # Clauses deleted for lack of memory : 0 0.20/0.50 # Backward-subsumed : 0 0.20/0.50 # Backward-rewritten : 0 0.20/0.50 # Generated clauses : 0 0.20/0.50 # ...of the previous two non-redundant : 0 0.20/0.50 # ...aggressively subsumed : 0 0.20/0.50 # Contextual simplify-reflections : 0 0.20/0.50 # Paramodulations : 0 0.20/0.50 # Factorizations : 0 0.20/0.50 # NegExts : 0 0.20/0.50 # Equation resolutions : 0 0.20/0.50 # Disequality decompositions : 0 0.20/0.50 # Total rewrite steps : 0 0.20/0.50 # ...of those cached : 0 0.20/0.50 # Propositional unsat checks : 0 0.20/0.50 # Propositional check models : 0 0.20/0.50 # Propositional check unsatisfiable : 0 0.20/0.50 # Propositional clauses : 0 0.20/0.50 # Propositional clauses after purity: 0 0.20/0.50 # Propositional unsat core size : 0 0.20/0.50 # Propositional preprocessing time : 0.000 0.20/0.50 # Propositional encoding time : 0.000 0.20/0.50 # Propositional solver time : 0.000 0.20/0.50 # Success case prop preproc time : 0.000 0.20/0.50 # Success case prop encoding time : 0.000 0.20/0.50 # Success case prop solver time : 0.000 0.20/0.50 # Current number of processed clauses : 0 0.20/0.50 # Positive orientable unit clauses : 0 0.20/0.50 # Positive unorientable unit clauses: 0 0.20/0.50 # Negative unit clauses : 0 0.20/0.50 # Non-unit-clauses : 0 0.20/0.50 # Current number of unprocessed clauses: 2 0.20/0.50 # ...number of literals in the above : 3 0.20/0.50 # Current number of archived formulas : 0 0.20/0.50 # Current number of archived clauses : 0 0.20/0.50 # Clause-clause subsumption calls (NU) : 0 0.20/0.50 # Rec. Clause-clause subsumption calls : 0 0.20/0.50 # Non-unit clause-clause subsumptions : 0 0.20/0.50 # Unit Clause-clause subsumption calls : 0 0.20/0.50 # Rewrite failures with RHS unbound : 0 0.20/0.50 # BW rewrite match attempts : 0 0.20/0.50 # BW rewrite match successes : 0 0.20/0.50 # Condensation attempts : 1 0.20/0.50 # Condensation successes : 0 0.20/0.50 # Termbank termtop insertions : 1915 0.20/0.50 # Search garbage collected termcells : 209 0.20/0.50 0.20/0.50 # ------------------------------------------------- 0.20/0.50 # User time : 0.004 s 0.20/0.50 # System time : 0.002 s 0.20/0.50 # Total time : 0.006 s 0.20/0.50 # Maximum resident set size: 1912 pages 0.20/0.50 0.20/0.50 # ------------------------------------------------- 0.20/0.50 # User time : 0.009 s 0.20/0.50 # System time : 0.002 s 0.20/0.50 # Total time : 0.010 s 0.20/0.50 # Maximum resident set size: 1800 pages 0.20/0.50 % E exiting 0.20/0.51 % E exiting 0.20/0.51 EOF